Primal-dual algrorithms for the assignment problem
نویسندگان
چکیده
منابع مشابه
Primal and dual assignment networks
This paper presents two recurrent neural networks for solving the assignment problem. Simplifying the architecture of a recurrent neural network based on the primal assignment problem, the first recurrent neural network, called the primal assignment network, has less complex connectivity than its predecessor. The second recurrent neural network, called the dual assignment network, based on the ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem
Akgiil, M., A genuinely polynomial primal simplex algorithm for the assignment problem, Discrete Applied Mathematics 45 (1993) 93-l 15. We present a primal simplex algorithm that solves the assignment problem in :n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,. ..,lt. The algorithm utilizes degeneracy by working with strongly feasible trees and ...
متن کاملPrimal-dual approaches to the Steiner problem
. We study several old and new algerithms for computing lower and upper bounds for the Steiner problem in networks using dual-ascent and primal-dual strategies. These strategies have been proven to be very useful. for the algorithmic treatment of the Steiner problem. We show that none of the known algorithms can both generate tight lower bounds empirically and guarantee their quality theoretica...
متن کاملA Primal-Dual Approximation Algorithm for the Steiner Forest Problem
Given an undirected graph with nonnegative edge-costs, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum q-Steiner forest problem is to find a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical minimum-cost Steiner tree problem on networks. We adapt a primal-dual approximation algorithm for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90016-3